Sensitivity Analysis for the Single-machine Preemptive Scheduling Problem of Minimizing Flow Time

Sensitivity analysis for the single-machine preemptive scheduling problem of minimizing flow time is discussed herein. Note that an optimal solution contains not just a combinatorial structure but also temporal structure. The specifies sequence in which jobs or job pieces are processed. provides start and completion every piece. It certain change parameters causes In this paper, we focus on robust performance structure, sequence, after single release data changes. By observing effects parameter found results only shifting forward (or backward) some blocks, amount equal to first piece size decrease increase) last increase decrease) any block. Furthermore,the are, respectively, same being processed Therefore, answer question rewrite block form, show its important properties. Then, necessary sufficient condition remain changes generated by four O(nlogn) iterative algorithms order blocks.